On Unimodality for Linear Extensions of Partial Orders

نویسندگان

  • Fan Chung Graham
  • Peter C. Fishburn
  • Ronald L. Graham
چکیده

R. Rivest has recently proposed the following intriguing conjecture: Let x* denote an arbitrary fixed element in an n-element partially ordered set P, and for each k in {1, 2, , n let Nk be the number of order-preserving maps from P onto {1, 2,..., n} that map x* into k. Then the sequence N1,'' ', N,, is unimodal. This note proves the conjecture for the special case in which P can be covered by two linear orders. It also generalizes this result for P that have disjoint components, one of which can be covered by two linear orders. 1. Introduction. Given a finite partially ordered set (P, <), where < is asymmetric, we say that an injection A from P into the set Z of integers is a linear extension of P if, for all x, y P, x < y :::),A (x) < A (y). We shall presume that P has n elements and, in the main part of the paper, restrict ourselves to bijections A :P-> In]-{1, 2,..., n}. Generalizations are discussed later. Let x* be an arbitrary fixed element in P. For each k [n], define Nk to be the

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

J un 2 01 7 Linear Extensions and Comparable Pairs in Partial Orders

We study the number of linear extensions of a partial order with a given proportion of comparable pairs of elements, and estimate the maximum and minimum possible numbers. We also show that a random interval partial order on n elements has close to a third of the pairs comparable with high probability, and the number of linear extensions is n! 2−Θ(n) with high probability.

متن کامل

A Ramsey theorem for partial orders with linear extensions

We prove a Ramsey theorem for finite sets equipped with a partial order and a fixed number of linear orders extending the partial order. This is a common generalization of two recent Ramsey theorems due to Sokić. As a bonus, our proof gives new arguments for these two results.

متن کامل

Toric partial orders

We define toric partial orders, corresponding to regions of graphic toric hyperplane arrangements, just as ordinary partial orders correspond to regions of graphic hyperplane arrangements. Combinatorially, toric posets correspond to finite posets under the equivalence relation generated by converting minimal elements into maximal elements, or sources into sinks. We derive toric analogues for se...

متن کامل

The Average Number of Linear Extensions of a Partial Order

Kleitman and Rothschild (Trans. Amer. Math. Soc. 205 (1975), 205-220) gave an asymptotic formula for the number of partial orders with ground-set In]. We give a shorter proof of their result and extend it to count the number of pairs (P, -<), where P is a partial order on [hi and -< is a linear extension of P. This gives us an asymptotic formula for (a) the average number of linear extensions o...

متن کامل

Actions on permutations and unimodality of descent polynomials

We study a group action on permutations due to Foata and Strehl and use it to prove that the descent generating polynomial of certain sets of permutations has a nonnegative expansion in the basis {t(1 + t)} i=0 , m = ⌊(n−1)/2⌋. This property implies symmetry and unimodality. We prove that the action is invariant under stack-sorting which strengthens recent unimodality results of Bóna. We prove ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • SIAM J. Matrix Analysis Applications

دوره 1  شماره 

صفحات  -

تاریخ انتشار 1980